Constructing Sublinear Expectations on Path Space
نویسندگان
چکیده
We provide a general construction of time-consistent sublinear expectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a generalization of the random Gexpectation, and an optional sampling theorem that holds without exceptional set. Our results also shed light on the inherent limitations to constructing sublinear expectations through aggregation.
منابع مشابه
Quasi-sure analysis, aggregation and dual representations of sublinear expectations in general spaces
We consider coherent sublinear expectations on a measurable space, without assuming the existence of a dominating probability measure. By considering a decomposition of the space in terms of the supports of the measures representing our sublinear expectation, we give a simple construction, in a quasi-sure sense, of the (linear) conditional expectations, and hence give a representation for the c...
متن کاملSTCON in Directed Unique-Path Graphs
We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON problem is to decide if there exists a path from s to t in G. For general graphs, the best polynomial-time algorithm for STCON uses space that is only slightly sublinear. However, for special classes of directed graphs, polynomi...
متن کاملRandom G-Expectations
We construct a time-consistent sublinear expectation in the setting of volatility uncertainty. This mapping extends Peng's G-expectation by allowing the range of the volatility uncertainty to be stochastic. Our construction is purely probabilistic and based on an optimal control formulation with path-dependent control sets.
متن کاملA New Central Limit Theorem under Sublinear Expectations
We describe a new framework of a sublinear expectation space and the related notions and results of distributions, independence. A new notion of G-distributions is introduced which generalizes our G-normal-distribution in the sense that mean-uncertainty can be also described. W present our new result of central limit theorem under sublinear expectation. This theorem can be also regarded as a ge...
متن کاملA Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the rst known deterministic sublinear space, polynomial time algorithm for directed s-t connectivity. For n-vertex graphs, our algorithm can use as little as n=2 ( p logn) space while still running in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012